A Billiard Metaphor for Exploring Complex Graphs
نویسندگان
چکیده
Exploring and revealing relations between the elements is a frequent task in exploratory analysis and search. Examples include that of correlations of attributes in complex data sets, or faceted search. Common visual representations for such relations are directed graphs or correlation matrices. These types of visual encodings are often if not always fully constructed before being shown to the user. This can be thought of as a top-down approach, where users are presented with a full picture for them to interpret and understand. Such a way of presenting data could lead to a visual overload, specially when it results in complex graphs with high degrees of nodes and edges. We propose a bottom-up alternative called Billiard where few elements are presented at rst and from which a user can interactively construct the rest based on what s/he nds of interest. The concept is based on a billiard metaphor where a cue ball (node) has an e ect on other elements (associated nodes) when stroke against them.
منابع مشابه
From Embodiment to Metaphor: A Study on Social Cognitive Development and Conceptual Metaphor in Persian-Speaking Children
This study explores the metaphoric comprehension of normal Persian-speaking children, as well as theories of cognitive development and cultural and social impacts. The researchers discuss the improvement of the understanding of ontological conceptual metaphors through age growth and cognitive development, and how it helps to expand children’s thoughts and knowledge of the world. In this study, ...
متن کاملMoving Against the Grain: Exploring Genre-Based Pedagogy in a New Context
Considerable literature explores the contribution of genre teaching in English academic writing. The role of this approach in developing academic writing of Iranian EFL students, however, has been underresearched. This study investigated the implications of using this approach with a class of undergraduate students in Iran. The current study reports on the findings of a project which employed a...
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملMetaphor: a Creative aid in Architectural Design Process
In the developing world, skills in innovation and creative design have emerged as key attributes for graduating designers. Creativity is essential if we want to generate new solutions to the considerable and complex problems in architecture. Metaphor is frequently expressed as a key tool for enhancing creative design, yet little empirical research has been performed on how novice designers can ...
متن کاملOn Right-angled Artin Groups without Surface Subgroups
We study the class N of graphs, the right-angled Artin groups defined on which do not contain surface subgroups. We prove that a presumably smaller class N ′ is closed under amalgamating along complete subgraphs, and also under adding bisimplicial edges. It follows that chordal graphs and chordal bipartite graphs belong to N ′.
متن کامل